efficiency of a multi-objective imperialist competitive algorithm: a bi-objective location-routing-inventory problem with probabilistic routes

Authors

najme nekooghadirli

reza tavakkoli-moghaddam

vahidreza ghezavati

abstract

an integrated model considers all parameters and elements of different deficiencies in one problem. this paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (lri) problem. this model also considers stochastic demands representing the customers’ requirement. the customers’ uncertain demand follows a normal distribution, in which each distribution center (dc) holds a certain amount of safety stock. in each dc, shortage is not permitted. furthermore, the routes are not absolutely available all the time. decisions are made in a multi-period planning horizon. the considered bi-objectives are to minimize the total cost and maximize the probability of delivery to customers. stochastic availability of routes makes it similar to real-world problems. the presented model is solved by a multi-objective imperialist competitive algorithm (moica). then, well-known multi-objective evolutionary algorithm, namely anon-dominated sorting genetic algorithm ii (nsga-ii), is used to evaluate the performance of the proposed moica. finally, the conclusion is presented.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

full text

A New Multi-Objective Inventory-Routing Problem by an Imperialist Competitive Algorithm

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

full text

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

full text

A Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows

This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...

full text

Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

full text

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

full text

My Resources

Save resource for easier access later


Journal title:
journal of ai and data mining

Publisher: shahrood university of technology

ISSN 2322-5211

volume 2

issue 2 2014

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023